#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
//vector<int> a;
//vector<bool> used;
const int value = 100010;
int v[value];
set<int> p;
int main(){
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    int n;
    cin >> n;
    //int counts = n;
    int b;
    for (int i = 0; i < n; i ++){
        cin >> b;
        v[b] ++;
        p.insert(b);
    //    a.push_back(b);
    //    used.push_back(0);
    }
    /*sort(a.begin(), a.end());
    for (int i = 0; i < n; i ++){
        int j = i + 1;
        while (a[i] == a[j] && j < n || used[j]){
            j ++;
        }
        if (j == n){
            break;
        }
        used[j] = 1;
        counts --;
    }
    cout << counts << endl;
    */
    bool flag = 1;
    int sum = 0;
    for (auto i : p){
        if (flag){
            sum += v[i];
            flag = 0;
            continue;
        }
        sum = max(v[i], sum);
    }
    cout << sum << endl;
    return 0;
}
